Probabilistic Robust Path Planning for Nonholonomic Arbitrary-Shaped Mobile Robots Using a Hybrid A* Algorithm
نویسندگان
چکیده
To guarantee safe motion planning, the underlying path planning algorithm must consider uncertainties and uncertain state information related to static, dynamic obstacles. This paper proposes novel hybrid A* (HA*) algorithms that uncertainty in of a mobile robot, position static obstacles, velocity Variants HA* are proposed wherein soft constraint is used cost function instead chance constraints for probability guarantees. The offers tradeoff between traveling distance safety paths without pruning additional nodes. Furthermore, this introduces method considering shape robot probabilistic planning. compared with existing performance evaluated using Monte Carlo simulation. Compared robust algorithms, significantly improved excessively increasing travel computational time. results also showed obstacles were safely avoided, which contrast conventional has high collision. In addition, approach led safer overall.
منابع مشابه
Efficient Path Planning for Nonholonomic Mobile Robots
This work addresses path planning for nonholonomic robots moving in two-dimensional space. The problem consists in computing a sequence of line segments that leads from the current configuration of the robot to a target location, while avoiding a given set of obstacles. We describe a planning algorithm that has the advantage of being very efficient, requiring less of one millisecond of CPU time...
متن کاملPSO-Based Path Planning Algorithm for Humanoid Robots Considering Safety
In this paper we introduce an improvement in the path planning algorithm for the humanoid soccer playing robot which uses Ferguson splines and PSO (Particle Swarm Optimization). The objective of the algorithm is to find a path through other playing robots to the ball, which should be as short as possible and also safe enough. Ferguson splines create preliminary paths using random generated para...
متن کاملA parallel path planning algorithm for mobile robots
This paper presents a path planning algorithm for mobile robots. We introduce a parallel search approach which is based on a regular grid representation of the map. The search is formulated as a cellular automaton by which local inter-cell communication rules are defined. The algorithm is made adaptive by utilising a multiresolution representation of the map. It is implemented on AMT DAP 510, w...
متن کاملMultilevel Path Planning for Nonholonomic Robots Using Semiholonomic Subsystems
We present a new and complete multi-level approach for solving path planning problems for nonholonomic robots. At the rst level a path is found that disrespects (some of) the nonholonomic constraints. At each next level a new path is generated, by transformation of the path generated at the previous level. The transformation is such that more nonholonomic constraints are respected than at the p...
متن کاملLocal Incremental Planning for Nonholonomic Mobile Robots
We present a simple approach for planning the motion of nonholonomic robots among obstacles. Existing methods lead to open-loop solutions which are either obtained in two stages, approximating a previously built holonomic path, or computationally intensive, being based on configuration space discretization. Our nonholonomic planner employs a direct projection strategy to modify on-line the outp...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Access
سال: 2021
ISSN: ['2169-3536']
DOI: https://doi.org/10.1109/access.2021.3093471